USING INSTANCE STATICTICS TO DETERMINE THE LOOKAHEAD PARAMETER VALUE IN THE ATC DISPATCH RULE Making a good heuristic better

نویسنده

  • Jorge M. S. Valente
چکیده

The Apparent Tardiness Cost (ATC) heuristic is one of the best performing dispatch rules for the weighted tardiness scheduling problem. This heuristic uses a lookahead parameter whose value must be specified. In this paper we develop a function that maps some instance statistics into an appropriate value for the lookahead parameter. This function is compared with some fixed values that have been previously used. The computational results show that the ATC heuristic performs better when the lookahead parameter value is determined by the proposed function.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved heuristics for the early/tardy scheduling problem with no idle time

In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. We present two new heuristics, a dispatch rule and a greedy procedure, and also consider the best of the existing dispatch rules. Both dispatch rules use a lookahead parameter that had previously been set at a fixed value. We develop functions that map some instance statistics into appropriate...

متن کامل

Heuristics for the Early/tardy Scheduling Problem with Release Dates

In this paper we consider the single machine earliness/tardiness scheduling problem with different release dates and no unforced idle time. We analyse the performance of several dispatch rules, a greedy procedure and a decision theory local search heuristic. The dispatch rules use a lookahead parameter whose value must be specified. We perform some experiments to determine an appropriate value ...

متن کامل

A two-stage stochastic rule-based model to determine pre-assembly buffer content

This study considers instant decision-making needs of the automobile manufactures for resequencing vehicles before final assembly (FA). We propose a rule-based two-stage stochastic model to determine the number of spare vehicles that should be kept in the pre-assembly buffer to restore the altered sequence due to paint defects and upstream department constraints. First stage of the model decide...

متن کامل

Intelligent Tuned Harmony Search for Solving Economic Dispatch Problem with Valve-point Effects and Prohibited Operating Zones

Economic dispatch with valve point effect and Prohibited Operating Zones (POZs) is a non-convex and discontinuous optimization problem. Harmony Search (HS) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. The performances of these variants are severely affected by selection of different parameters of the algorithm. Intel...

متن کامل

A Novel Heuristic Optimization Methodology for Solving of Economic Dispatch Problems

This paper presents a biogeography-based optimization (BBO) algorithm to solve the economic loadDispatch (ELD) problem with generator constraints in thermal plants. The applied method can solvethe ELD problem with constraints like transmission losses, ramp rate limits, and prohibited operatingzones. Biogeography is the science of the geographical distribution of biological species. The modelsof...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003